Orderings with $\alpha$th jump degree ${\bf 0}\sp {(\alpha)}$
نویسندگان
چکیده
منابع مشابه
On Computing Min-Degree Elimination Orderings
We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric positive definite matrix as edges of an undirected graph, and aims at reducing the additional non-zeros (fill) in the matrix by repeatedly removing the vertex of minimum degree. It is one of the most widely used primit...
متن کاملThere Is No Degree Invariant Half-jump
We prove that there is no degree invariant solution to Post’s problem that always gives an intermediate degree. In fact, assuming definable determinacy, if W is any definable operator on degrees such that a <W (a) < a′ on a cone then W is low2 or high2 on a cone of degrees, i.e., there is a degree c such that W (a)′′ = a′′ for every a ≥ c or W (a)′′ = a′′′ for every a ≥ c. A striking phenomenon...
متن کاملOn Computing Janet Bases for Degree Compatible Orderings
We consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the standard data base of polynomial benchmarks for Gröbner bases software we compare the modifications and confront them with Magma that implements Faugère’s F4...
متن کاملDegree spectra of the successor relation of computable linear orderings
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings, the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.
متن کاملAcceptability with General Orderings
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1992
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1992-1065942-0